Modularity-like objective function in annotated networks
نویسندگان
چکیده
We ascertain the modularity-like objective function whose optimization is equivalent to the maximum likelihood in annotated networks. We demonstrate that the modularity-like objective function is a linear combination of modularity and conditional entropy. In contrast with statistical inference methods, in our method, the influence of the metadata is adjustable; when its influence is strong enough, the metadata can be recovered. Conversely, when it is weak, the detection may correspond to another partition. Between the two, there is a transition. This paper provides a concept for expanding the scope of modularity methods.
منابع مشابه
Mining Overlapping Communities in Real-world Networks Based on Extended Modularity Gain
Detecting communities plays a vital role in studying group level patterns of a social network and it can be helpful in developing several recommendation systems such as movie recommendation, book recommendation, friend recommendation and so on. Most of the community detection algorithms can detect disjoint communities only, but in the real time scenario, a node can be a member of more than one ...
متن کاملMaximum Maintainability of Complex Systems via Modulation Based on DSM and Module Layout.Case Study:Laser Range Finder
The present paper aims to investigate the effects of modularity and the layout of subsystems and parts of a complex system on its maintainability. For this purpose, four objective functions have been considered simultaneously: I) maximizing the level of accordance between system design and optimum modularity design,II) maximizing the level of accessibility and the maintenance space required,III...
متن کاملA Multiagent Reinforcement Learning algorithm to solve the Community Detection Problem
Community detection is a challenging optimization problem that consists of searching for communities that belong to a network under the assumption that the nodes of the same community share properties that enable the detection of new characteristics or functional relationships in the network. Although there are many algorithms developed for community detection, most of them are unsuitable when ...
متن کاملGeneralized modularity measure for evaluating community structure in complex networks
Discovering community structure is fundamental for uncovering the links between structure and function in complex networks and modularity optimization is the widely accepted method for this issue. However, there is no consensus criteria for measuring the community structure. In this paper, we propose a new quantitative function for community partition–i.e., generalized modularity or M value. We...
متن کاملConstrained Community Detection in Social Networks
Community detection in networks is the process of identifying unusually wellconnected sub-networks and is a central component of many applied network analyses. The paradigm of modularity optimization stipulates a partition of the network’s vertices which maximizes the difference between the fraction of edges within groups (communities) and the expected fraction if edges were randomly distribute...
متن کامل